Preparing the next gravitational million-body simulations: evolution of single and binary stars in <tt> <scp>nbody6++gpu</scp> </tt>, <tt> <scp>mocca</scp> </tt>, and <tt> <scp>mcluster</scp> </tt>

نویسندگان

چکیده

We present the implementation of updated stellar evolution recipes in codes \texttt{Nbody6++GPU, MOCCA} and \texttt{McLuster}. test them through numerical simulations star clusters containing $1.1\times 10^5$ stars (with $2.0\times 10^4$ primordial hard binaries) performing high-resolution direct $N$-body (\texttt{Nbody6++GPU}) Monte-Carlo (\texttt{MOCCA}) to an age 10~Gyr. compare models implementing either delayed or core-collapse supernovae mechanisms, a different mass ratio distribution for binaries, white dwarf natal kicks enabled/disabled. Compared \texttt{Nbody6++GPU}, \texttt{MOCCA} appear be denser, with larger scatter remnant masses, lower binary fraction on average. The produce more black holes (BHs) helium dwarfs (WDs), whilst \texttt{Nbody6++GPU} are characterised by much amount WD-WD binaries. kick velocity escape speed distributions similar BHs neutron (NSs), some NSs formed via electron-capture supernovae, accretion-induced collapse merger-induced cluster all simulations. WDs, other hand, very dissimilar. categorise available \texttt{Mcluster} into four levels: one implemented previous versions (\texttt{level A}), state-of-the-art prescriptions B}), testing phase C}), those that will added future our codes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SSS* = Alpha-Beta + TT

In 1979 Stockman introduced the SSS* minimax search algorithm that dominates Alpha-Beta in the number of leaf nodes expanded. Further investigation of the algorithm showed that it had three serious drawbacks, which prevented its use by practitioners: it is difficult to understand, it has large memory requirements, and it is slow. This paper presents an alternate formulation of SSS*, in which it...

متن کامل

Mkb Tt ( System Description ) ?

We describe performance enhancements that have been added to mkbTT, a modern completion tool combining multi-completion with the use of termination tools.

متن کامل

Sss* = Α-β + Tt

In 1979 Stockman introduced the SSS* minimax search algorithm that dominates Alpha-Beta in the number of leaf nodes expanded. Further investigation of the algorithm showed that it had three serious drawbacks, which prevented its use by practitioners: it is difficult to understand, it has large memory requirements, and it is slow. This paper presents an alternate formulation of SSS*, in which it...

متن کامل

. Hox TT - Publikaties , Amsterdam 1995

All rights reserved. For noncommercial use only, this publication may be reproduced, stored in a retrieval system, or transmitted, in any form and by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the author and the publisher, provided the source is given and fully cited.

متن کامل

Tangent Cones to TT Varieties

As already done for the matrix case in [6, p.256], [1, Thm. 6.1, p.1872] and [10, Thm. 3.2] we give a parametrization of the Bouligand tangent cone of the variety of tensors of bounded TT rank. We discuss how the proof generalizes to any binary hierarchical format. The parametrization can be rewritten as an orthogonal sum of TT tensors. Its retraction onto the variety is particularly easy to co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Monthly Notices of the Royal Astronomical Society

سال: 2021

ISSN: ['0035-8711', '1365-8711', '1365-2966']

DOI: https://doi.org/10.1093/mnras/stab3748